A partial analysis of modified realizability
نویسنده
چکیده
In [3], the following semantical picture of modified realizability is sketched: Consider the topos Set, whose objects are functions between sets, and whose arrows are commutative squares. The logic of Set corresponds to “Kripke forcing over a 2-element linear order”. Over Set, one can define the standard realizability topos Eff→ (not to be confused with Eff!). The modified realizability topos, Mod , then is a closed subtopos of Eff→; more precisely, Mod is the closed complement of Eff in Eff→. This means, that there is a subobject U of 1 in Eff→, or a global section 1 u → Ω, such that the internal topology in Eff→ whose sheaves form Mod , is given by: j(x) = x ∨ u
منابع مشابه
Proof interpretations with truth
This article systematically investigates so-called “truth variants” of several functional interpretations. We start by showing a close relation between two variants of modified realizability, namely modified realizability with truth and q-modified realizability. Both variants are shown to be derived from a single “functional interpretation with truth” of intuitionistic linear logic. This analys...
متن کاملModels of intuitionistic set theory in subtoposes of nested realizability toposes
Given a partial combinatory algebra (pca) A (see e.g. [16]) together with a subpca A# of A we will construct the nested realizability topos RT(A,A#) as described in [5] (without giving it a proper name there). It is well known (from e.g. [16]) that RT(A,A#) appears as the exact/regular completion of its subcategory Asm(A,A#) of assemblies. In [5] the authors considered two complementary subtopo...
متن کاملSimulation of Singular Fourth- Order Partial Differential Equations Using the Fourier Transform Combined With Variational Iteration Method
In this paper, we present a comparative study between the modified variational iteration method (MVIM) and a hybrid of Fourier transform and variational iteration method (FTVIM). The study outlines the efficiencyand convergence of the two methods. The analysis is illustrated by investigating four singular partial differential equations with variable coefficients. The solution of singular partia...
متن کاملModified Realizability Toposes and Strong Normalization Proofs
This paper is motivated by the discovery that an appropriate quotient SN 3 of the strongly normalising untyped 3-terms (where 3 is just a formal constant) forms a partial applicative structure with the inherent application operation. The quotient structure satises all but one of the axioms of a partial combinatory algebra (pca). We call such partial applicative structures conditionally partial ...
متن کاملFrom Constructive Mathematics to Computable Analysis via the Realizability Interpretation
Constructive mathematics is mathematics without the use of the principle of the excluded middle. There exists a wide array of models of constructive logic. One particular interpretation of constructive mathematics is the realizability interpretation. It is utilized as a metamathematical tool in order to derive admissible rules of deduction for systems of constructive logic or to demonstrate the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Log.
دوره 69 شماره
صفحات -
تاریخ انتشار 2004